Negation and Generalized Quantifiers

نویسنده

  • Frans Zwarts
چکیده

Linguistic research has clearly shown that natural languages exhibit different forms of negation. Foremost among these are sentence negation and predicate negation. In this study, the relationship between both will be discussed. In particular, it wiu be argued that we can give an accurate description of the logical connections between sentence negation and predicate negation by reference to the semantical nature of the subject noun phrase. To this end, two important classes of generalized quantifiers will be distinguished, having to do with the familiar logical notions of consistency and completeness. Next, it will be shown that the distribution of negative adverbs in languages as Dutch and German forces us to make a distinction between predicate negation and verb negation as well. The logical relationship between these two forms of negation appears to be the same as that between sentence negation and predicate negation. Finally, it will be demonstrated that the difference between predicate negation and verb negation also shows up in languages such as English, particularly in co~ec t ion with monotonicity patterns.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HENRIËTTE DE SWART and IVAN A. SAG NEGATION AND NEGATIVE CONCORD IN ROMANCE

This paper addresses the two interpretations that a combination of negative indefinites can get in concord languages like French: a concord reading, which amounts to a single negation, and a double negation reading. We develop an analysis within a polyadic framework, where a sequence of negative indefinites can be interpreted as an iteration of quantifiers or via resumption. The first option le...

متن کامل

Type Checking and Inference for Polymorphic and Existential Types in Multiple-Quantifier and Type-Free Systems

A multiple quantifier is a quantifier having inference rules that introduce or eliminate arbitrary number of quantifiers by one inference. This paper introduces the lambda calculus with negation, conjunction, and multiple existential quantifiers, and the lambda calculus with implication and multiple universal quantifiers. Their type checking and type inference are proved to be undecidable. This...

متن کامل

Non-prenex QBF Solving Using Abstraction

In a recent work, we introduced an abstraction based algorithm for solving quantified Boolean formulas (QBF) in prenex negation normal form (PNNF) where quantifiers are only allowed in the formula’s prefix and negation appears only in front of variables. In this paper, we present a modified algorithm that lifts the restriction on prenex quantifiers. Instead of a linear quantifier prefix, the al...

متن کامل

Generating Quantifiers and Negation to Explain Homework Testing

We describe Prograder, a software package for automatic checking of requirements for programming homework assignments. Prograder lets instructors specify requirements in natural language as well as explains grading results to students in natural language. It does so using a grammar that generates as well as parses to translate between a small fragment of English and a first-order logical specif...

متن کامل

Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies

It is well-known that Independence Friendly (IF) logic is equivalent to existential second-order logic (Σ1) and, therefore, is not closed under classical negation. The Boolean closure of IF sentences, called Extended IF-logic, on the other hand, corresponds to a proper fragment of ∆2. In this article we consider SL(↓), IF-logic extended with Hodges’ flattening operator ↓, which allows to define...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005